A hard integer program made easy by lexicography
نویسندگان
چکیده
A small but notoriously hard integer program formulated by Donald Knuth fifty years ago is solved by three versions of a lexicographic algorithm using Gomory cuts. The lexicographic cutting plane algorithms are faster than CPLEX on this problem by a factor of at least 20.
منابع مشابه
Strong formulations for mixed integer programs: valid inequalities and extended formulations
We examine progress over the last fifteen years in finding strong valid inequalities and tight extended formulations for simple mixed integer sets lying both on the “easy” and “hard” sides of the complexity frontier. Most progress has been made in studying sets arising from knapsack and single node flow sets, and a variety of sets motivated by different lot-sizing models. We conclude by citing ...
متن کاملOn stability of some lexicographic integer optimization problem
A lexicographic integer optimization problem with criteria represented by absolute values of linear functions is considered. Five types of stability for the set of lexicographic optima under small changes of the parameters of the vector criterion are investigated.
متن کاملComputational Models and Complexities of Tarski’s Fixed Points∗
We consider two models of computation for Tarski’s order preserving function f related to fixed points in a complete lattice: the oracle function model and the polynomial function model. We develop a complete understanding under the oracle function model for finding a Tarski’s fixed point as well as determining the uniqueness of Tarski’s fixed point in both the lexicographic ordering and the co...
متن کاملOptimal Deployment of Distributed Systems
As our world becomes more interconnected, there is an increasingly important role for distributed computer system. Designing these systems is not an easy task. Progress has been made in this regard with the development of formal specification languages and verification tools. One area that is usually not addressed is the deployment of a system. This is unfortunate as the deployment can be criti...
متن کاملiv : m at h . A C / 0 50 13 45 v 3 1 3 O ct 2 00 5 The generic Gröbner walk
The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An important parameter is explicit numerical perturbation of this line. This usually involves both time and space demanding arithmetic of integers much...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 135 شماره
صفحات -
تاریخ انتشار 2012